Computational Complementarity and Sofic Shifts
نویسندگان
چکیده
Finite automata (with outputs but no initial states) have been extensively used as models of computational complementarity, a property which mimics the physical complementarity. All this work was focussed on \frames", i.e., on xed, static, local descriptions of the system behaviour. In this paper we are mainly interested in the asymptotical description of complementarity. To this aim we will study the asymptot-ical behaviour of two complementarity principles by associating to every incomplete deterministic automaton (with outputs, but no initial state) certain sooc shifts: au-tomata having the same behaviour correspond to a unique sooc shift. In this way, a class of sooc shifts reeecting complementarity will be introduced and studied. We will prove that there is a strong relation between \local complementarity", as it is perceived at the level of \frames", and \asymptotical complementarity" as it is described by the sooc shift. 1 Motivation Physical systems are normally described by measurements. For example, a gas is described by the position and momentum of its molecules and a swinging pendulum is characterized by its angle from the vertical and its angular velocity. In the simplest case the set of possible values describing a system can be arranged in a sequence, a lm which is innnite in both directions: each frame of the lm|describing the system in a xed interval of time|depends upon the previous one, usually in a continuous way. The notion of measurement is strongly connected to physical complementarity: the observer either experiences one certain type of observation, (exclusive) or a diierent, complementary one. The \folklore" understanding of complementarity, in general, and of Heisenberg's uncertainty relation, in particular, is the existence of certain (complementary) features of quantum systems which cannot be measured and predicted simultaneously with arbitrary accuracy. In other words, any description of properties of microscopic objects in classical terms generates pairs of complementary variables; the accuracy in one member
منابع مشابه
Computational Aspects of Cellular Automata on Countable Sofic Shifts
We investigate the computational properties of cellular automata on countable (equivalently, zero entropy) sofic shifts with an emphasis on nilpotency, periodicity, and asymptotic behavior. As a tool for proving decidability results, we prove the Starfleet Lemma, which is of independent interest. We present computational results including the decidability of nilpotency and periodicity, the unde...
متن کاملQuantifier Extensions of Multidimensional Sofic Shifts
We define a pair of simple combinatorial operations on subshifts, called existential and universal extensions, and study their basic properties. We prove that the existential extension of a sofic shift by another sofic shift is always sofic, and the same holds for the universal extension in one dimension. However, we also show by a construction that universal extensions of twodimensional sofic ...
متن کاملSofic and Almost of Finite Type Tree-Shifts
We introduce the notion of sofic tree-shifts which corresponds to symbolic dynamical systems of infinite trees accepted by finite tree automata. We show that, contrary to shifts of infinite sequences, there is no unique minimal deterministic irreducible tree automaton accepting an irreducible sofic tree-shift, but that there is a unique synchronized one, called the Shannon cover of the tree-shi...
متن کاملSofic-Dyck Shifts
We define the class of sofic-Dyck shifts which extends the class of Markov-Dyck shifts introduced by Inoue, Krieger and Mat-sumoto. Sofic-Dyck shifts are shifts of sequences whose finite factors form unambiguous context-free languages. We show that they correspond exactly to the class of shifts of sequences whose sets of factors are visibly pushdown languages. We give an expression of the zeta ...
متن کاملMultidimensional Sofic Shifts without Separation and Their Factors
For d ≥ 2 we exhibit mixing Z shifts of finite type and sofic shifts with large entropy but poorly separated subsystems (in the sofic examples, the only minimal subsystem is a single point). These examples consequently have very constrained factors; in particular, no non-trivial full shift is a factor. We also provide examples to distinguish certain mixing conditions, and develop the natural cl...
متن کامل